Coalgebraic Bisimulation-Up-To
نویسندگان
چکیده
Bisimulation-up-to enhances the bisimulation proof method for process equivalence. We present its generalization from labelled transition systems to arbitrary coalgebras, and show that for a large class of systems, enhancements such as bisimulation up to bisimilarity, up to equivalence and up to context are sound proof techniques. This allows for simplified bisimulation proofs for many different types of state-based systems.
منابع مشابه
Truth-as-Simulation: Towards a Coalgebraic Perspective on Logic and Games
Building on the work of L. Moss on coalgebraic logic, I study in a general setting a class of infinitary modal logics for F -coalgebras, designed to capture simulation and bisimulation. For a notion of coalgebraic simulation, I use the work of A. Thijs on modelling simulation in terms of relators Γ (extensions of SET -functors along some family of preoders): simulation is the analogue for relat...
متن کاملInheritance and Cofree Constructions
The coalgebraic view on classes and objects is elaborated to include inheritance. Inheritance in coalgebraic speciication (of classes) will be understood dually to parametrization in algebraic speciication. That is, inheritance involves restriction (specialization), where parametrization involves extension. And cofree constructions are \best" restrictions, like free constructions are \best" ext...
متن کاملA Companion to Coalgebraic Weak Bisimulation for Action-Type Systems∗
We propose a coalgebraic definition of weak bisimulation for classes of coalgebras obtained from bifunctors in the category Set. Weak bisimilarity for a system is obtained as strong bisimilarity of a transformed system. The particular transformation consists of two steps: First, the behavior on actions is lifted to behavior on finite words. Second, the behavior on finite words is taken modulo t...
متن کاملCoalgebraic Weak Bisimulation for Action-Type Systems
We propose a coalgebraic definition of weak bisimulation for classes of coalgebras obtained from bifunctors in the category Set. Weak bisimilarity for a system is obtained as strong bisimilarity of a transformed system. The particular transformation consists of two steps: First, the behavior on actions is lifted to behavior on finite words. Second, the behavior on finite words is taken modulo t...
متن کاملLax Kleisli-valued presheaves and coalgebraic weak bisimulation
We generalize the work by Sobociński on relational presheaves and their connection with weak (bi)simulation for labelled transistion systems to a coalgebraic setting. We show that the coalgebraic notion of saturation studied in our previous work can be expressed in the language of lax functors in terms of existence of a certain adjunction between categories of lax functors. This observation all...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013